منابع مشابه
Automated Pattern-Based Pointcut Generation
One of the main problems in Aspect-Oriented Software Development is the so-called fragile pointcut problem. Uncovering and specifying a good robust pointcut is not an easy task. In this paper we propose to use Inductive Logic Programming, and more specifically the FOIL algorithm, to automatically identify intentional pattern-based pointcuts. We present the toolchain we implemented to induce a p...
متن کاملHeading-Aware Snippet Generation for Web Search
We propose heading-aware methods of generating search result snippets of web pages. A heading is a brief description of the topic of its associated sentences. Some existing methods give priority to sentences containing many words that also appear in headings when selecting sentences to be included in snippets with limited length. However, according to our observation, words in heading are very ...
متن کاملAnalogue Core-Based Test-Pattern Generation*
– Core-based testing, which is described by the proposed IEEE standard P1500, is an effective test method for Systems-on-Chip (SOC) containing embedded cores. This test method is usable for all classes of digital cores and provides solutions that allow automatic identification and configuration of testability features in SOC containing embedded cores. In this moment, IEEE P1500 is restricted to...
متن کاملSentence Generation for Pattern-Based Machine Translation
In this paper we discuss sentence generation strategy for pattern-based machine translation and their computational properties. Even though sentence generation in general is known to be computationally expensive, there exists a polynomial-time algorithm for synchronized sentence analysis/generation for “fixed” pattern-based (and its variant) grammars. Experimental results of implemented algorit...
متن کاملSAT-based Automatic Test Pattern Generation
Due to the rapidly growing size of integrated circuits, there is a need for new algorithms for Automatic Test Pattern Generation (ATPG). While classical algorithms reach their limit, there have been recent advances in algorithms to solve Boolean Satisfiability (SAT). Because Boolean SAT solvers are working on Conjunctive Normal Forms (CNF), the problem has to be transformed. During transformati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.1830